Normal forms for answer sets programming
نویسندگان
چکیده
منابع مشابه
Normal forms for answer sets programming
Normal forms for logic programs under stable/answer set semantics are introduced. We argue that these forms can simplify the study of program properties, mainly consistency. The rst normal form, called the kernel of the program, is useful for studying existence and number of answer sets. A kernel program is composed of the atoms which are unde ned in the Well-founded semantics, which are those ...
متن کاملEditorial: Programming with Answer Sets
The search for an appropriate characterization of negation as failure in logic programs in the mid 1980s led to several proposals. Amongst them the stable model semantics – later referred to as answer set semantics, and the well-founded semantics are the most popular and widely referred ones. According to the latest (September 2002) list of most cited source documents in the CiteSeer database t...
متن کاملAnswer Sets and the Language of Answer Set Programming
Answer set programming is a declarative programming paradigm based on the answer set semantics of logic programs. This introductory article provides the mathematical background for the discussion of answer set programming in other contributions to this special issue.
متن کاملNormal Forms for Inductive Logic Programming
In this paper we study induction of unrestricted clausal theories from interpretations. First, we show that in the propositional case induction from complete evidence can be seen as an equivalence-preserving transformation from DNF to CNF. From this we conclude that induction i s essentially a process of determining what is false in the domain of discourse. We then proceed by investigating dual...
متن کاملAnswer Sets for Prioritized
Connict resolution is an important issue in knowledge representation and reasoning. A common idea of solving connicts in reasoning is to add preferences in the underlying reasoning mechanism. This paper describes extensions of Gelfond and Lifschitz's extended logic programs 5] by adding preference information. We rst propose prioritized logic programs (PLPs) in which the preference is expressed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2005
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068404002339